首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   762篇
  免费   279篇
  国内免费   43篇
  2024年   2篇
  2023年   9篇
  2022年   11篇
  2021年   12篇
  2020年   25篇
  2019年   26篇
  2018年   19篇
  2017年   54篇
  2016年   52篇
  2015年   43篇
  2014年   56篇
  2013年   62篇
  2012年   59篇
  2011年   68篇
  2010年   48篇
  2009年   67篇
  2008年   38篇
  2007年   59篇
  2006年   59篇
  2005年   50篇
  2004年   52篇
  2003年   26篇
  2002年   28篇
  2001年   31篇
  2000年   25篇
  1999年   25篇
  1998年   12篇
  1997年   16篇
  1996年   4篇
  1995年   6篇
  1994年   8篇
  1993年   10篇
  1992年   8篇
  1991年   7篇
  1990年   4篇
  1989年   2篇
  1988年   1篇
排序方式: 共有1084条查询结果,搜索用时 15 毫秒
101.
Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
102.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
103.
We address infinite‐horizon models for oligopolies with competing retailers under demand uncertainty. We characterize the equilibrium behavior which arises under simple wholesale pricing schemes. More specifically, we consider a periodic review, infinite‐horizon model for a two‐echelon system with a single supplier servicing a network of competing retailers. In every period, each retailer faces a random demand volume, the distribution of which depends on his own retail price as well as those charged by possibly all competing retailers. We also derive various comparative statics results regarding the impact several exogenous system parameters (e.g., cost or distributional parameters) have on the equilibrium decisions of the retailers as well as their expected profits. We show that certain monotonicity properties, engrained in folklore as well as in known inventory models for centralized systems, may break down in decentralized chains under retailer competition. Our results can be used to optimize the aggregate profits in the supply chain (i.e., those of the supplier and all retailers) by implementing a specific wholesale pricing scheme. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
104.
We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
105.
就树视图与数据库的结合实现树视图的无级动态维护提出了一种解决方法 ,进而拓展了树视图的功能 ,使其能够得到更多的使用。  相似文献   
106.
对定常态不可逆卡诺热机进行了有限时间热力学分析.定义了功率、效率和面积比系数,并导出三者的关系式,由此对热机最佳功率、效率和面积特性进行了分析和讨论,给出了一些有益的结论.  相似文献   
107.
程序输入变量取值范围的确定对于测试数据的选取,尤其对边界值分析,有着直接的指导作用.一般情形下,通过对源程序进行数据流和相关性分析,可实现输入变量的取值分析.但对某些有特殊取值限制要求的表达式,用静态分析方法,难以实现其输入变量的取值分析.为此,采用动态模拟的方法,对有特殊取值限制要求的表达式,进行输入变量的取值分析.实验表明,该方法是行之有效的.  相似文献   
108.
活塞缸是火炮动态后坐装置中的关键部件,其结构强度设计是整个实验装置强度设计的核心。利用I-DEAS软件,在对其进行实体建模和有限元网格划分的基础上,计算了活塞缸整体的应力应变值,得到了活塞缸工作时的应力应变图,并对其结构中应力状况恶劣的部位进行了结构优化。  相似文献   
109.
纳秒级电磁脉冲模拟器的研制   总被引:2,自引:0,他引:2  
介绍了纳秒级电磁脉冲模拟器的组成和主要指标,分析了脉冲高压电源的各项参数对脉冲模拟器输出波形上升前沿的影响,给出了实测数值和波形。测量结果表明此电磁脉冲模拟器可以输出前沿大约为2 58ns、衰落时间约55ns的双指数脉冲波。  相似文献   
110.
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号